The stability radius of an efficient solution in minimax Boolean programming problem
نویسندگان
چکیده
We consider a vector minimax Boolean programming problem. The problem consists in finding the set of Pareto optimal solutions. When the problem’s parameters vary then the optimal solution of the problem obtained for some initial parameters may appear non-optimal. We calculate the maximal perturbation of parameters which preseves the optimality of a given solution of the problem. The formula for the stability radius of the given Pareto optimal solution was obtained.
منابع مشابه
Robustness in portfolio optimization based on minimax regret approach
Portfolio optimization is one of the most important issues for effective and economic investment. There is plenty of research in the literature addressing this issue. Most of these pieces of research attempt to make the Markowitz’s primary portfolio selection model more realistic or seek to solve the model for obtaining fairly optimum portfolios. An efficient frontier in the ...
متن کاملMulticriteria variant of Markowitz ’ s invest - ment problem with Savage ’ s minimax risk criteria under uncertainty TUCS
Based on Markowitz’s classical theory we formulate a multicriteria Boolean portfolio optimization problem using Savage’s minimax risk criteria. We obtain lower and upper attainable bounds for stability radius of the Pareto optimal portfolio in the case of metric l1 in the space of portfolios, and metric l∞ in the space of risks.
متن کاملSensitivity analysis of efficient solution in vector MINMAX boolean programming problem ∗ Vladimir
We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained. MSC: 90C29, 90C31
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کامل